Balancing Turn-Based Games With Chained Strategy Generation
نویسندگان
چکیده
منابع مشابه
Adaptive Intelligence for Turn-based Strategy Games
Computer games are an increasingly popular form of entertainment. Typically, the quality of AI opponents in computer games leaves a lot to be desired, which poses many attractive challenges for AI researchers. In this respect, Turn-based Strategy (TBS) games are of particular interest. These games are focussed on high-level decision making, rather than low-level behavioural actions. Moreover, t...
متن کاملAdaptive Spatial Reasoning for Turn-based Strategy Games
The quality of AI opponents often leaves a lot to be desired, which poses many attractive challenges for AI researchers. In this respect, Turn-based Strategy (TBS) games are of particular interest. These games are focussed on high-level decision making, rather than low-level behavioural actions. For efficiently designing a TBS AI, in this paper we propose a game AI architecture named ADAPTA (Al...
متن کاملAdaptative Map Generation For Turn-based Strategic Multiplayer Browser Games
This thesis addresses the problems of Random Map Generation which are strategically and visual interesting for turn-based strategy Massively Multiplayer Online Games (MMOG). First we present the results of the research regarding works related to this subject. Previously used methodologies are reviewed and the techniques used in some MMOGs analyzed. Next we describe a method to create strategica...
متن کاملBalancing Zero-Sum Games with One Variable per Strategy
A key challenge in game design is achieving balance between the strategies available to the players. Traditionally this has been done through playtesting, with its difficult requirements of time, labor, and interpretation of results. To make it quicker and easier to balance games, we propose a game-theoretic approach that automatically balances strategies based on a mathematical model of the ga...
متن کاملNon - cooperative games with chained confirmed proposals
We propose a bargaining process with alternating proposals as a way of solving non-cooperative games, giving rise to Pareto efficient agreements which will, in general, differ from the Nash equilibrium of the constituent games. JEL classification: C72; C73; C78.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Games
سال: 2021
ISSN: 2475-1502,2475-1510
DOI: 10.1109/tg.2019.2943227